Super efficiency in vector optimization with nearly convexlike set-valued maps
نویسندگان
چکیده
منابع مشابه
Strict Efficiency in Vector Optimization with Nearly Convexlike Set-Valued Maps
and Applied Analysis 3 (3) Δ S (y) < 0 for every y ∈ intA, Δ S (y) = 0 for every y ∈ ∂A, and Δ S (y) > 0 for every y ∈ int S; (4) if S is closed, then it holds that S = {y : Δ S (y) ≤ 0}; (5) if S is a convex, then Δ S is convex; (6) if S is a cone, then Δ S is positively homogeneous; (7) if S is a closed convex cone, then Δ S is nonincreasing with respect to the ordering relation induced on Y....
متن کاملOptimality Conditions for Vector Optimization with Set-Valued Maps
In this paper, we establish a Farkas-Minkowski type alternative theorem under the supposition of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we present necessary optimality conditions and sufficient optimality conditions for set-valued vector optimization problems with extended inequality constraints in a sense of weak E-minimizers.
متن کاملSuper Efficiency in Vector Optimization
We introduce a new concept of efficiency in vector optimization. This concept, super efficiency, is shown to have many desirable properties. In particular, we show that in reasonable settings the super efficient points of a set are norm-dense in the efficient frontier. We also provide a Chebyshev characterization of super efficient points for nonconvex sets and a scalarization theory when the u...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملOptimality Conditions for Vector Optimisation with Set-valued Maps
In recent years, vector optimisation with set-valued maps in infinite dimensional spaces has been received an increasing amount of attention. See [6, 2, 5, 8, 4, 9] and references therein, for its extensive applications in many fields such as mathematical programming, optimal control, management science. Vector optimisation with setvalued maps, sometimes called set-valued vector optimisation fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2002
ISSN: 0022-247X
DOI: 10.1016/s0022-247x(02)00452-3